1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
| import java.util.Arrays;
public class Code013_FindOnlyOnceNum {
public static void main(String[] args) { int[] array1 = {1,1,2,2,3,4,4,5,5}; System.out.println(findOnlyOnceNumI(array1));
int[] array2 = {1,1,2,2,3,4,4,5}; System.out.println(Arrays.toString(findOnlyOnceNumII(array2)));
int[] array3 = {1,1,1,2,2,2,3,4,4,4,5,5,5}; System.out.println(findOnlyOnceNumIII(array3));
int[] array4 = {2,2,2,2,2,3,4,4,4,5}; System.out.println(findNumIV(array4)); }
private static int findOnlyOnceNumI(int[] array) { if (array == null || array.length == 0) return 0; int result = 0; for (int num : array) { result ^= num; } return result; }
private static int[] findOnlyOnceNumII(int[] array) { int xor = 0; for (int num : array) { xor ^= num; }
int mask = xor & (-xor);
int a = 0, b = 0; for (int num : array) { if ((num & mask) == 0) { a ^= num; } else { b ^= num; } }
return new int[]{a, b}; }
public static int findOnlyOnceNumIII(int[] array) { int result = 0; for (int i = 0; i < 32; i++) { int count = 0; for (int num : array) { count += (num >> i) & 1; } if (count % 3 != 0) { result |= (1 << i); } } return result; }
public static int findNumIV(int[] array) { int candidate = 0; int count = 0; for (int num : array) { if (count == 0) { candidate = num; } if (num == candidate) { count++; } else { count--; } } return candidate; } }
|